Further Applications of Clutter Domination Parameters to Projective Dimension

نویسندگان

  • HAILONG DAO
  • JAY SCHWEIG
چکیده

We study the relationship between the projective dimension of a squarefree monomial ideal and the domination parameters of the associated graph or clutter. In particular, we show that the projective dimensions of graphs with perfect dominating sets can be calculated combinatorially. We also generalize the wellknown graph domination parameter τ to clutters, obtaining bounds on the projective dimension analogous to those for graphs. Through Hochster’s Formula, our bounds on projective dimension also give rise to bounds on the homologies of the associated Stanley-Reisner complexes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding the Projective Dimension of a Squarefree Monomial Ideal via Domination in Clutters

We introduce the concept of edgewise domination in clutters, and use it to provide an upper bound for the projective dimension of any squarefree monomial ideal. We then compare this bound to a bound given by Faltings. Finally, we study a family of clutters associated to graphs and compute domination parameters for certain classes of these clutters.

متن کامل

The existence totally reflexive covers

Let $R$ be a commutative Noetherian ring. We prove that  over a local ring $R$ every finitely generated $R$-module $M$ of finite Gorenstein projective dimension has a Gorenstein projective cover$varphi:C rightarrow M$ such that $C$ is finitely generated and the projective dimension of $Kervarphi$ is finite and $varphi$ is surjective.

متن کامل

Projective dimension, graph domination parameters, and independence complex homology

We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs. In particular, we draw heavily from the topic of dominating sets. Through Hochster’s Formula, we recover and strengthen existing results on the homological connectivity of graph independence complexes.

متن کامل

Gorenstein projective objects in Abelian categories

Let $mathcal {A}$ be an abelian category with enough projective objects and $mathcal {X}$ be a full subcategory of $mathcal {A}$. We define Gorenstein projective objects with respect to $mathcal {X}$ and $mathcal{Y}_{mathcal{X}}$, respectively, where $mathcal{Y}_{mathcal{X}}$=${ Yin Ch(mathcal {A})| Y$ is acyclic and $Z_{n}Yinmathcal{X}}$. We point out that under certain hypotheses, these two G...

متن کامل

Characterization of some projective special linear groups in dimension four by their orders and degree patterns

‎Let $G$ be a finite group‎. ‎The degree pattern of $G$ denoted by‎ ‎$D(G)$ is defined as follows‎: ‎If $pi(G)={p_{1},p_{2},...,p_{k}}$ such that‎ ‎$p_{1}

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014